Intersection Graphs of k-uniform Linear Hypergraphs
نویسندگان
چکیده
منابع مشابه
Edge intersection graphs of linear 3-uniform hypergraphs
Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by a finite list of forbidden induced su...
متن کاملRecognizing large-degree Intersection Graphs of Linear 3-Uniform Hypergraphs
The intersection graph or the line graph Ω(H) of a hypergraph H is defined as follows: 1) the vertices of Ω(H) are in a bijective correspondence with the edges of H, 2) two vertices are adjacent in Ω(H) if and only if the corresponding edges intersect. Characterizing and recognizing intersection graphs of hypergraphs with some additional property P is one of the central problems in intersection...
متن کاملK-connectivity of Uniform S-intersection Graphs
Let W1, . . . ,Wn be independent random subsets of [m] = {1, . . . ,m}. Assuming that each Wi is uniformly distributed in the class of d-subsets of [m] we study the uniform random intersection graph Gs(n,m, d) on the vertex set {W1, . . .Wn}, defined by the adjacency relation: Wi ∼ Wj whenever |Wi ∩Wj | ≥ s. We show that as n,m → ∞ the edge density threshold for the property that each vertex of...
متن کاملC-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer k,p and q, 2q ≤ p we construct a k-uniform hypergraph H with small clique number whose circular chromatic number equals p q . We define the concept and study the properties of c-perfect k-uniform hypergraphs .
متن کاملPacking k-partite k-uniform hypergraphs
Let G and H be k-graphs (k-uniform hypergraphs); then a perfect H-packing in G is a collection of vertex-disjoint copies of H in G which together cover every vertex ofG. For any fixed k-graphH let δ(H,n) be the minimum δ such that any k-graphG on n vertices with minimum codegree δ(G) ≥ δ contains a perfect H-packing. The problem of determining δ(H,n) has been widely studied for graphs (i.e. 2-g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1982
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(82)80029-2